UPPER BOUNDS ON POLYNOMIALS WITH SMALL GALOIS GROUP
نویسندگان
چکیده
منابع مشابه
Multi-parameter Polynomials with Given Galois Group
The non-Abelian finite simple groups and their automorphism groups play a crucial role in an inductive approach to the inverse problem of Galois theory. The rigidity method (see, for example, Malle and Matzat, 1999) has proved very efficient for deducing the existence of Galois extensions with such groups, as well as for the construction of polynomials generating such extensions. Nevertheless, ...
متن کاملUpper Bounds on the Covering Number of Galois-Planes with Small Order
Our paper deals with a problem of P. Erd} os' related to the covering number of blocking sets of nite projective planes. An integer linear programming (ILP) formulation of Erd} os' problem is introduced for projective planes of given orders. The mathematical programming based approach for this problem is new in the area of nite projective planes. Since the ILP problem is NP-hard and may involve...
متن کاملUpper Bounds for the Number of Number Fields with Alternating Galois Group
We study the number N(n,An, X) of number fields of degree n whose Galois closure has Galois group An and whose discriminant is bounded by X. By a conjecture of Malle, we expect that N(n,An, X) ∼ Cn ·X 1 2 ·(logX)bn for constants bn and Cn. For 6 ≤ n ≤ 84393, the best known upper bound is N(n,An, X) � X n+2 4 ; this bound follows from Schmidt’s Theorem, which implies there are � X n+2 4 number f...
متن کاملUpper Bounds on the Complexity of Some Galois Theory Problems
Assuming the generalized Riemann hypothesis, we prove the following complexity bounds: The order of the Galois group of an arbitrary polynomial f(x) ∈ Z[x] can be computed in P#P. Furthermore, the order can be approximated by a randomized polynomial-time algorithm with access to an NP oracle. For polynomials f with solvable Galois group we show that the order can be computed exactly by a random...
متن کاملGalois Group Computation for Rational Polynomials
We describe methods for the computation of Galois groups of univariate polynomials over the rationals which we have implemented up to degree 15. These methods are based on Stauduhar's algorithm. All computations are done in unramiied p-adic extensions. For imprimitive groups we give an improvement using subbelds. In the primitive case we use known subgroups of the Galois group together with a c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematika
سال: 2020
ISSN: 0025-5793,2041-7942
DOI: 10.1112/mtk.12050